Multiple states based temporal consistency for dynamic verification of fixed-time constraints in Grid workflow systems
نویسندگان
چکیده
To verify fixed-time constraints in Grid workflow systems, consistency and inconsistency conditions have been defined in conventional verification work. However, with a view of the run-time uncertainty of activity completion duration, we argue that, although the conventional consistency condition is feasible, the conventional inconsistency condition is too restrictive and covers several different states. These states, which are handled conventionally by the same exception handling, should be handled differently for the purpose of cost saving. Therefore, in this paper, we divide conventional inconsistency into weak consistency, weak inconsistency and strong inconsistency and treat conventional consistency as strong consistency. Correspondingly, we develop some algorithms on how to verify them. Based on this, for weak consistency we present a method on how to adjust it to strong consistency by using mean activity time redundancy and temporal dependency between fixed-time constraints. For weak inconsistency, we analyse briefly why it can be handled by simpler and more cost-saving exception handling while for strong inconsistency, the conventional exception handling remains deployed. The final quantitative evaluation demonstrates that our research can achieve better cost-effectiveness than the conventional work. Copyright c © 2006 John Wiley & Sons, Ltd.
منابع مشابه
Selecting Necessary and Sufficient Checkpoints for Dynamic Verification of Fixed-Time Constraints in Grid Workflow Systems
In grid workflow systems, existing representative checkpoint selection strategies, which are used to select checkpoints for verifying fixed-time constraints at run-time execution stage, often select some unnecessary checkpoints and ignore some necessary ones. Consequently, overall temporal verification efficiency and effectiveness can be severely impacted. In this paper, we propose a new strate...
متن کاملTemporal Dependency for Dynamic Verification of Fixed-Date Constraints in Grid Workflow Systems
Grid workflow systems aim to support large-scale complex e-science and e-business processes. Due to the complexity of these kinds of processes, to control the execution of them in terms of time in the grid workflow execution environment, multiple fixed-date temporal constraints often need to be set simultaneously. Hence the dependency problem between them must be considered and emphasised, whic...
متن کاملMultiple Consistency States of Fixed-time Constraints in Grid Workflow Systems
To verify fixed-time constraints in grid workflow systems, the consistency and the inconsistency conditions have been defined in the conventional verification work. However, with a view of the run-time uncertainty of the activity completion duration, we argue that although the conventional consistency condition is fine, the conventional inconsistency condition is too rigorous and covers several...
متن کاملNecessary and Sufficient Checkpoint Selection in Grid Workflow Systems
In grid workflow systems, existing representative checkpoint selection strategies, which are used to select checkpoints for verifying fixed-time constraints at run-time execution stage, often select some unnecessary checkpoints and ignore some necessary ones. Consequently, overall temporal verification efficiency and effectiveness can be severely impacted. In this paper, we propose a new strate...
متن کاملActivity Completion Duration Based Checkpoint Selection for Dynamic Verification of Temporal Constraints in Grid Workflow Systems
In grid workflow systems, to verify temporal constraints efficiently at run-time execution stage, some checkpoints are often selected so that we only need to conduct temporal verification at such checkpoints rather than at all activity points. However, existing typical checkpoint selection strategies often ignore some necessary checkpoints and select some unnecessary ones. This would eventually...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Concurrency and Computation: Practice and Experience
دوره 19 شماره
صفحات -
تاریخ انتشار 2007